Optimizing the quality control station configuration

We study unreliable serial production lines with known failure probabilities for each operation. Such a production line consists of a series of stations, existing machines, and optional quality control stations (QCSs). Our aim is to decide on the allocation of the QCSs within the assembly line, so as to maximize the expected profit of the system. In such a problem, the designer has to determine the QCS configuration and the production rate simultaneously. The profit maximization problem is approximated assuming exponentially distributed processing times, Poisson arrival process of jobs into the system, and the existing of holding costs. The novel feature of our model is the incorporation of holding costs that significantly complicated the problem. Our approximation approach uses a branch and bound strategy that employs our fast dynamic programming algorithm for minimizing the expected operational costs for a given production rate as a subroutine. Extensive numerical experiments are conducted to demonstrate the efficiency of the branch and bound procedure for solving large scale instances of the problem and for obtaining some qualitative insights.

相似文献   

磁性目标跟踪的后验克拉美罗下限分析与计算

为了求解磁性目标跟踪问题的后验克拉美罗下限(PCRB),提出了PCRB-GMSPPF算法。该算法利用高斯混合采样粒子滤波算法对目标状态的真实后验概率密度分布进行抽样,再通过蒙特卡洛积分法迭代求解每个观测时刻的Fisher信息矩阵,进而得出目标状态估计的PCRB;克服了基于PF算法求解PCRB过程中由于粒子退化和贫化问题造成不能从后验概率分布中正确抽样的缺点;在建立磁性目标跟踪的状态模型和观测模型的基础上进行仿真分析,将求解出的PCRB与采用GMSPPF及PF算法进行跟踪的均方根误差做对比,验证所提的PCRB-GMSPPF算法的有效性,结果表明:针对磁性目标跟踪问题,PCRB-GMSPPF算法较PCRB-PF算法具有更好的准确性,并可用于一般的非线性模型跟踪误差下限分析。     

二维TOA定位中的最小GDOP问题

基于二维TOA定位的Cramer?Rao下界,对传感器测量精度不尽相同的一般情形,推导获得了最优GDOP值及其充要条件,并利用GDOP等值线图进行了验证。结果表明,最佳的GDOP 值是传感器测量精度的简单表达式,或一个带约束条件的组合优化问题的最优值。     

A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017     

纯方位角目标运动分析的可观测性研究

纯方位角目标运动分析的可观测性是纯方位角观测系统中的一个基本问题.只有解决了系统的可观测性,才能进行有效的目标定位及跟踪.从随机系统的角度分析了纯方位角观测系统的可观测性,引入状态参量的Fisher信息矩阵作为判断系统可观测性的依据,提出了完全不同于判定确定性系统可观测性的随机观测系统可观测性的判定方法.最后给出了一个静止目标纯方位角观测系统的实例,说明了该方法的有效性.     

基于遗传算法的陆基导航布站方法研究

陆基导航是一种通过高精度的测距进行定位、定速的系统,其定位、定速精度与布站有密切关系.为优化陆基导航的布站结果,提高惯性+陆基复合导航精度,提出了一种基于遗传算法的陆基导航布站方法.推导了使用惯性+陆基复合导航的Cramer-Rao下界(CRLB),并以其作为遗传算法布站寻优的适应性函数,再结合其他影响布站的因素作为约束条件,形成了基于遗传算法的布站方法.数学仿真表明,通过该方法的布站可得到较为满意的复合导航的精度,在实际工程应用中具有重要意义.     

非齐次边值问题解的存在性

研究非齐次边界条件下,含有p—Laplacian算子的微分方程解的存在性,应用上下解方法,得到边值问题可解性的充分条件．     

基于SRUKF的异类信源多模型跟踪算法

针对多传感器系统中基于冗余和互补信息的机动目标跟踪,以及传感器探测任务平稳交接问题,提出基于SRUKFIMM多信源综合滤波算法进行目标状态估计,提高了目标状态估计精度;并依据当前最新相关量测与滤波预测值的偏差等信息,进行自适应航迹升/降维控制。仿真结果表明:滤波输出稳定平滑、精度高,可有效降低部分信源采样缺失对目标跟踪稳定性的影响,具有较强的鲁棒性能。     

Evaluating methods for the reliability of a large 2‐dimensional rectangular k‐within‐consecutive‐(r,s)‐out‐of‐(m,n):F system

A 2‐dimensional rectangular k‐within‐consecutive‐(r, s)‐out‐of‐(m, n):F system consists of m × n components, and fails if and only if k or more components fail in an r × s submatrix. This system can be treated as a reliability model for TFT liquid crystal displays, wireless communication networks, etc. Although an effective method has been developed for evaluating the exact system reliability of small or medium‐sized systems, that method needs extremely high computing time and memory capacity when applied to larger systems. Therefore, developing upper and lower bounds and accurate approximations for system reliability is useful for large systems. In this paper, first, we propose new upper and lower bounds for the reliability of a 2‐dimensional rectangular k‐within‐consecutive‐(r, s)‐out‐of‐(m, n):F system. Secondly, we propose two limit theorems for that system. With these theorems we can obtain accurate approximations for system reliabilities when the system is large and component reliabilities are close to one. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

A branch and bound algorithm for sector allocation of a naval task group

A naval task group (TG) is a collection of naval combatants and auxiliaries that are grouped together for the accomplishment of one or more missions. Ships forming a TG are located in predefined sectors. We define determination of ship sector locations to provide a robust air defense formation as the sector allocation problem (SAP). A robust formation is one that is very effective against a variety of attack scenarios but not necessarily the most effective against any scenario. We propose a 0‐1 integer linear programming formulation for SAP. The model takes the size and the direction of threat into account as well as the defensive weapons of the naval TG. We develop tight lower and upper bounds by incorporating some valid inequalities and use a branch and bound algorithm to exactly solve SAP. We report computational results that demonstrate the effectiveness of the proposed solution approach. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011